Structure Mapping for Jeopardy! Clues
نویسنده
چکیده
The Jeopardy! television quiz show asks natural-language questions and requires natural-language answers. One useful source of information for answering Jeopardy! questions is text from written sources such as encyclopedias or news articles. A text passage may partially or fully indicate that some candidate answer is the correct answer to the question. Recognizing whether it does requires determining the extent to which what the passage is saying about the candidate answer is similar to what the question is saying about the desired answer. This paper describes how structure mapping [1] (an algorithm originally developed for analogical reasoning) is applied to determine similarity between content in questions and passages. That algorithm is one of many used in the Watson question answering system [2]. It contributes a significant amount to Watson’s effectiveness.
منابع مشابه
SPAR-Key: Processing SPARQL-Fulltext Queries to Solve Jeopardy! Clues
We describe our SPAR-Key query engine that implements indexing, ranking, and query processing techniques to run a new kind of SPARQL-fulltext queries that were provided in the context of the INEX 2013 Jeopardy Task.
متن کاملIn the game: The interface between Watson and Jeopardy!
To play as a contestant in Jeopardy!i, IBM Watsoni needed an interface program to handle the communications between the Jeopardy! computers that operate the game and its own components: question answering, game strategy, speech, buzzer, etc. Because Watson cannot hear or see, when the categories and clues were displayed on the game board, they were also sent electronically to Watson. The progra...
متن کاملRecent Computer Science Ph . D . graduates ( AY 2009 - 2010 )
Eric Brown and Watson take on Jeopardy! challenge Q uestion Answering (QA) has been an active area of research for several decades. Instead of retrieving whole web pages in response to keyword queries, as is typical for web search engines, a QA system retrieves answers to questions. Eric Brown (Ph.D. '96) has been involved in QA since 1999, when he developed a custom search engine at the IBM T....
متن کاملExistence Results of best Proximity Pairs for a Certain Class of Noncyclic Mappings in Nonreflexive Banach Spaces Polynomials
Introduction Let be a nonempty subset of a normed linear space . A self-mapping is said to be nonexpansive provided that for all . In 1965, Browder showed that every nonexpansive self-mapping defined on a nonempty, bounded, closed and convex subset of a uniformly convex Banach space , has a fixed point. In the same year, Kirk generalized this existence result by using a geometric notion of ...
متن کاملAssessment of geostatistical and interpolation methods for mapping forest dieback intensity in Zagros forests
During recent years, oak decline has been widely spread across Brant’s oak (Quercus Brantii Lindl.) stands in the Zagros Mountains, Western Iran, which caused large-area forest dieback in several sites. Mapping the intensity and spatial distribution of forest dieback is essential for developing management and control strategies. This study evaluated a range of geostatistical and interpolation m...
متن کامل